Confidence regions for bivariate probability density functions using polygonal areas
نویسندگان
چکیده
منابع مشابه
Extracting Object Regions Using Locally Estimated Probability Density Functions
In this paper, a novel method for estimating a precise object region using a given rough object region is proposed. For determining whether each pixel belongs to an object or not, the proposed method estimates a joint probability density function (joint p.d.f.) of position, color, and class (object or background). For each pixel, the class with a higher joint p.d.f. is selected. The joint p.d.f...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولConstructing belief functions from sample data using multinomial confidence regions
The Transferable Belief Model is a subjectivist model of uncertainty in which an agent’s beliefs at a given time are modeled using the formalism of belief functions. Belief functions that enter the model are usually either elicited from experts, or must be constructed from observation data. There are, however, few simple and operational methods available for building belief functions from data....
متن کاملA Verified Compiler for Probability Density Functions
Bhat et al. [1] developed an inductive compiler that computes density functions for probability spaces described by programs in a probabilistic functional language. In this work, we implement such a compiler for a modified version of this language within the theorem prover Isabelle and give a formal proof of its soundness w.r.t. the semantics of the source and target language. Together with Isa...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
سال: 2020
ISSN: 1303-5991
DOI: 10.31801/cfsuasmas.542499